A heuristic for the single-product capacitated facility layout problem with random demand
نویسندگان
چکیده
منابع مشابه
Facility layout design with random demand and capacitated machines
We consider the facility layout problem with machine capacities (and hence multiple machines of each type) and random demand. We develop a very efficient heuristic allowing us to find good solutions to the stochastic case whenever good solutions can be found for the corresponding deterministic problem with uncapacitated machines of the same dimension. Hence, this problem represents a case where...
متن کاملA Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
This paper presents a very large scale neighborhood (VLSN) search algorithm for the capacitated facility location problem with single-source constraints. The neighborhood structures are induced by customer multi-exchanges and by facility moves. We consider both single-customer multi-exchanges, detected on a suitably de ned customer improvement graph, and multi-customer multi-exchanges, detected...
متن کاملA Hybrid Simulated Annealing algorithm for Single Row Facility Layout Problem
This article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. Regarding the NP-Hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. A number of test problems are randomly generat...
متن کاملA Non-greedy Local Search Heuristic for Facility Layout Problem
This paper proposes a non-greedy local search heuristic for solving facility layout problem. The proposed heuristic works on non-greedy systematic pair wise exchange of two facilities, that is 2-exchange local search based on non-greedy strategy. Pair wise exchanges are accepted if the objective function value after the exchange is lowered or smaller than the average objective function incremen...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Transportation and Logistics
سال: 2015
ISSN: 2192-4376
DOI: 10.1007/s13676-014-0052-6